|
In computer science, a mergeable heap (also called a meldable heap) is an abstract data type, which is a heap supporting a merge operation. == Definition == A mergeable heap supports the following operations:〔Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. ''Introduction to Algorithms''. 2009, 3rd ed. The MIT Press. ISBN 978-0-262-53305-8.〕 * Make-Heap(), creating an empty heap.* Insert(H,x), inserting an element x into the heap H.* Min(H), returning the minimum element, or Nil if no such element exists.* Extract-Min(H), extracting and returning the minimum element, or Nil if no such element exists.* Merge(H1,H2), combining the elements of H1 and H2.抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「mergeable heap」の詳細全文を読む スポンサード リンク
|